New solution procedures for the order picker routing problem in U-shaped pick areas with a movable depot

Abstract This paper develops new solution procedures for the order picker routing problem in U-shaped picking zones with a movable depot, which has so far only been solved using simple heuristics. The presents first exact approach, based on combinatorial Benders decomposition, as well heuristic approach dynamic programming that extends idea of venerable sweep algorithm. In computational study, we demonstrate can solve small instances well, while is fast and exhibits an average optimality gap close to zero all test instances. Moreover, investigate influence various storage assignment policies from literature compare them newly derived policy shown be advantageous under certain circumstances. Secondly, effects having depot compared fixed one effort move depot.